Discrete approximations to vector spin models
نویسندگان
چکیده
منابع مشابه
Exponential Models: Approximations for Probabilities
Welch & Peers (1963) used a root-information prior to obtain posterior probabilities for a scalar parameter exponential model and showed that these Bayes probabilities had the confidence property to second order asymptotically. An important undercurrent of this indicates that the constant information reparameterization provides location model structure, for which the confidence property ...
متن کاملDiscrete Vector Models for Catalysis and Autocatalysis
1 Institut für Angewandte und Physikalische Chemie, Arbeitsgruppe Chemische Synergetik, Universität Bremen, Bibliothekstraße NW 2, 28359 Bremen, Germany 2Department of Physical Chemistry, Spatiotemporal Self-organization Group, Fritz-Haber-Institut der Max-Planck-Gesellschaft, Faradayweg 4-6, 14195 Berlin, Germany 3Department of Physical Chemistry Complex Systems Group, Fritz-Haber-Institut der...
متن کاملReexamining Discrete Approximations to Continuous Distributions
D is a common decision analysis technique for which many methods are described in the literature and employed in practice. The accuracy of these methods is typically judged by how well they match the mean, variance, and possibly higher moments of the underlying continuous probability distribution. Previous authors have analyzed the accuracy of differing discretization methods across a limited s...
متن کاملDiscrete Approximations to Reflected Brownian Motion∗
In this paper we investigate three discrete or semi-discrete approximation schemes for reflected Brownian motion on bounded Euclidean domains. For a class of bounded domains D in R that includes all bounded Lipschitz domains and the von Koch snowflake domain, we show that the laws of both discrete and continuous time simple random walks on D ∩ 2Z moving at the rate 2 with stationary initial dis...
متن کاملDiscrete approximations to continuum optimal flow problems
Problems in partial differential equations with inequality constraints can be used to describe a continuum analog to various optimal flow/cut problems. While general concepts from convex optimization (like duality) carry over into continuum problems, the application of ideas and algorithms from linear programming and network flow problems is challenging. The capacity constraints are non-linear ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2011
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/44/47/475002